Maximum packing channel assignment in cellular networks
نویسندگان
چکیده
منابع مشابه
Channel Assignment in Multihop Cellular Networks
Recently, several work related to channel assignment for MCN-type systems were reported. Wu et al proposed diverting traffic from the congested cells to the non-congested cells (Wu et al., 2001; Wu et al., 2004), which is achieved by relaying traffic through unlicensed frequency band, such as the industrial, scientific and medical (ISM) band. For iCAR (Wu et al., 2001; Wu et al., 2004), ad hoc ...
متن کاملFixed Channel Assignment and Neural Network Algorithm for Channel Assignment Problem in Cellular Radio Networks
The channel-assignment problem is important in mobile telephone communication. Since the usable range of the frequency spectrum is limited, the optimal channel-assignment problem has become increasingly important. The goal of this problem is to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. This algorithm co...
متن کاملPrioritized Channel Assignment to Multimedia Calls in Wireless Cellular Networks
Two important Quality of Service (QOS) parameters in cellular networks are call blocking probability (CBP) and handoff dropping probability (HDP). CBP represents the probability that a new call is blocked due to unavailability of channels. HDP represents the probability that a handoff call is dropped if no channel is available in the new cell. How to keep the probability of handoff drops within...
متن کاملOn an Optimal Algorithm for Channel Assignment in Cellular Networks
A cellular network is often modelled as a graph and the channel assignment problem is formulated as a coloring problem of the graph. In a recent paper [16], we introduced the notion of cellular graphs that models the hexagonal cell structure of a cellular network. Assuming a k-band buffering system where the interference does not extend beyond k cells away from the call originating cell, we pro...
متن کاملA Graph Theoretic Approach for Channel Assignment in Cellular Networks
We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 1999
ISSN: 0018-9545
DOI: 10.1109/25.765003